Volumetric Untrimming: Precise decomposition of trimmed trivariates into tensor products

3D objects, modeled using Computer Aided Geometric Design tools, are traditionally represented using a boundary representation (B-rep), and typically use spline functions to parameterize these boundary surfaces. However, recent development in physical analysis, in isogeometric analysis (IGA) in specific, necessitates a volumetric parametrization of the interior of the object. IGA is performed directly by integrating over the spline spaces of the volumetric spline representation of the object. Typically, tensor-product B-spline trivariates are used to parameterize the volumetric domain. A general 3D object, that can be modeled in contemporary B-rep CAD tools, is typically represented using trimmed B-spline surfaces. In order to capture the generality of the contemporary B-rep modeling space, while supporting IGA needs, Massarwi and Elber (2016) proposed the use of trimmed trivariates volumetric elements. However, the use of trimmed geometry makes the integration process more difficult since integration over trimmed B-spline basis functions is a highly challenging task. In this work, we propose an algorithm that precisely decomposes a trimmed B-spline trivariate into a set of (singular only on the boundary) tensor-product B-spline trivariates, that can be utilized to simplify the integration process in IGA. The trimmed B-spline trivariate is first subdivided into a set of trimmed B\'ezier trivariates, at all its internal knots. Then, each trimmed B\'ezier trivariate, is decomposed into a set of mutually exclusive tensor-product B-spline trivariates, that precisely cover the entire trimmed domain. This process, denoted untrimming, can be performed in either the Euclidean space or the parametric space of the trivariate. We present examples on complex trimmed trivariates' based geometry, and we demonstrate the effectiveness of the method by applying IGA over the (untrimmed) results.Comment: 18 pages, 32 figures. Contribution accepted in International Conference on Geometric Modeling and Processing (GMP 2019

Hidden curve removal for free form surfaces

Journal ArticleThis paper describes a hidden curve algorithm specifically designed for sculptured surfaces. A technique is described to extract the visible curves for a given scene without the need to approximate the surface by polygons. This algorithm produces higher quality results than polygon based algorithms, as most of the output set has an exact representation. Surface coherence is used to speed up the process. Although designed for sculptured surfaces, this algorithm is also suitable for polygonal data

Second order surface analysis using hybrid symbolic and numeric operators

Journal ArticleResults from analyzing the curvature of a surface can be used to improve the implementation, efficiency, and effectiveness of manufacturing and visualization of sculptured surfaces. In this paper, we develop a robust method using hybrid symbolic and numeric operators to create trimmed surfaces each of which is solely convex, concave, or saddle and partitions the original surface. The same method is also used to identify regions whose curvature lies within prespecified bounds

Adaptive isocurves based rendering for freeform surfaces

Journal ArticleFreeform surface rendering is traditionally performed by approximating the surface with polygons and then rendering the polygons. This approach is extremely common because of the complexity in accurately rendering the surfaces directly. Recently, several papers presented methods to render surfaces as sequences of isocurves. Unfortunately, these methods start by assuming that an appropriate collection of isocurves has already been derived. The algorithms themselves neither automatically create an optimal or almost optimal set of isocurves so t h e whole surface would be correctly rendered without having pixels redundantly visited nor automatically compute the parameter spacing required between isocurves to guarantee such coverage. In this paper, a new algorithm is developed to fill these needs. An algorithm is introduced that automatically computes a set of almost optimal isocurves covering the entire surface area. This algorithm can be combined with a fast curve rendering method, to make surface rendering without polygonal approximation practical

Adaptive isocurves based rendering for freeform surfaces

technical reportFreeform surface rendering is traditionally performed by approximating the surface with polygons and then rendering the polygons This approach is extremely common because of the complexity in accurately rendering the surfaces directly Recently?? several papers presented methods to render surfaces as sequences of isocurves Unfortunately?? these methods start by assuming that an appropriate collection of isocurves has already been derived The algorithms themselves neither automatically create an optimal or almost optimal set of isocurves so the whole surface would be correctly rendered without having pixels redundantly visited nor automatically compute the parameter spacing required between isocurves to guarantee such coverage In this paper?? a new algorithm is developed to ll these needs An algorithm is introduced that automat ically computes a set of almost optimal isocurves covering the entire surface area This algorithm can be combined with a fast curve rendering method?? to make surface rendering without polygonal approximation practica

Multiresolution curve editing with linear constraints

The use of multiresolution control toward the editing of freeform curves and surfaces has already been recognized as a valuable modeling too

MATHICSE Technical Report: Volumetric Untrimming: Precise decomposition of trimmed trivariates into tensor products

3D objects, modeled using Computer Aided Geometric Design (CAGD) tools, are traditionally represented using a boundary representation (B-rep), and typically use spline functions to parameterize these boundary surfaces. However, recent development in physical analysis, in isogeometric analysis (IGA) in specic, necessitates a volumetric parametrization of the interior of the object. IGA is performed directly by integrating over the spline spaces of the volumetric spline representation of the object. Typically, tensor-product B-spline trivariates are used to parameterize the volumetric domain. A general 3D object, that can be modeled in contemporary B-rep CAD tools, is typically represented using trimmed B-spline surfaces. In order to capture the generality of the contemporary B-rep modeling space, while supporting IGA needs, Massarwi and Elber (2016) proposed the use of trimmed trivariates volumetric elements. However, the use of trimmed geometry makes the integration process more difficult since integration over trimmed B-spline basis functions is a highly challenging task Xu et al. (2017). In this work, we propose an algorithm that precisely decomposes a trimmed B-spline trivariate into a set of (singular only on the boundary) tensor-product B-spline trivariates, that can be utilized to simplify the integration process, in IGA. The trimmed B-spline trivariate is first subdivided into a set of trimmed B--spline trivariates, at all its internal knots. Then, each trimmed Bezier trivariate, is decomposed into a set of mutually exclusive tensor-product B-spline trivariates, that precisely cover the entire trimmed domain. This process, denoted untrimming, can be performed in either the Euclidean space or the parametric space of the trivariate. We present examples of the algorithm on complex trimmed trivariates' based geometry, and we demonstrate the effectiveness of the method by applying IGA over the (untrimmed) results